A Counterexample to Cover's 2P Conjecture on Gaussian Feedback Capacity
نویسنده
چکیده
We provide a counterexample to Cover’s conjecture that the feedback capacity CFB of an additive Gaussian noise channel under power constraint P be no greater than the nonfeedback capacity C of the same channel under power constraint 2P , i.e., CFB(P ) C(2P ). Index Terms|Additive Gaussian noise channels, channel capacity, conjecture, counterexample, feedback.
منابع مشابه
Factor-of-two Bound for Capacity in Gaussian Channel with Feedback and Cover’s Conjecture
We consider the upper bounds of the finite block length capacity Cn,FB(P ) of the discrete time Gaussian channel with feedback. We prove the refinements of relations Cn(P ) ≤ Cn,FB(P ) ≤ Cn(P ) + 1 2 and Cn(P ) ≤ Cn,FB(P ) ≤ 2Cn(P ), which are given by Cover and Pombra. And we prove the relation C2(P ) ≤ C2,FB(P ) < C2(2P ), which is a partial solution of the conjecture given by Cover.
متن کاملOn the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملFrom Almost Gaussian to Gaussian Bounding Differences of Differential Entropies
We consider lower and upper bounds on the difference of differential entropies of a Gaussian random vector and an almost Gaussian random vector after both are “smoothed” by an arbitrarily distributed random vector of finite power. These bounds are important to prove the optimality of corner points in the capacity region of Gaussian interference channels. The upper bound, presented in MaxEnt-201...
متن کاملOn equivariant global epsilon constants for certain dihedral extensions
We consider a conjecture of Bley and Burns which relates the epsilon constant of the equivariant Artin L-function of a Galois extension of number fields to certain natural algebraic invariants. For an odd prime number p, we describe an algorithm which either proves the conjecture for all degree 2p dihedral extensions of the rational numbers or finds a counterexample. We apply this to show the c...
متن کاملOn the Outage Probability Conjecture for MIMO Channels
Multiple-Input-Multiple-Output (MIMO) communication systems have seen wide application due to its performance benefits such as multiplexing gain. For MIMO systems with non-ergodic Gaussian channel, a conjecture regarding its outage probability has been proposed by Telatar in [1]. This conjecture has been proved for the special single-output case, and is in general assumed to be true. In this wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 52 شماره
صفحات -
تاریخ انتشار 2006